Orbit Dirichlet series and multiset permutations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiset Permutations in Lexicographic Order

In a previous work [12], we proposed a method for generating permutations in lexicographic order. In this study, we extend it to generate multiset permutations. A multiset is a collection of items that are not necessarily distinct. The guideline of the extension is to skip, as soon as possible, those partially-formed permutations that are less than or equal to the latest generated eligible perm...

متن کامل

Pattern avoidance in compositions and multiset permutations

One of the most arresting phenomena in the theory of pattern avoidance by permutations is the fact that the number of permutations of n letters that avoid a pattern π of 3 letters is independent of π. In this note we exhibit two generalizations of this fact, to ordered partitions, a.k.a. compositions, of an integer, and to permutations of multisets. It is remarkable that the conclusions are in ...

متن کامل

Permutations of a Multiset Avoiding Permutations of Length 3

Let α = (a1, . . . , am) and β = (b1, . . . , bn) be two sequences of numbers. The sequence α is said to be contained in β as a pattern (or be involved in β) if there is a subsequence bi1 , . . . , bim (with i1 < i2 < · · · < im) of β which is order isomorphic to α; in other words, ar ≤ as if and only if bir ≤ bis . If β does not contain α we say that β avoids α. This notion has surfaced many t...

متن کامل

Pattern Avoidance in Multiset Permutations: Bijective Proof

A permutation σ = σ1σ2 . . . σn of n letters contains the pattern τ = τ1τ2 . . . τk of k letters if for some i1 < i2 < · · · < ik we have σis < σit whenever τs < τt. A permutation is said to avoid any pattern it does not contain. It is well-known that the number of permutations of n letters that avoid a pattern τ of 3 letters is independent of τ . Savage and Wilf [3] have shown the same result ...

متن کامل

Lossless Compression Using Inversions on Multiset Permutations

Ziya Arnavut Computer Science and Engineering, University of Nebraska-Lincoln, NE 68588 [email protected] Linear prediction schemes, such as JPEG or BJPEG, are simple and normally result in a significant reduction in source entropy. Occasionally the entropy of the prediction error becomes greater than that of the original image. Such situations frequently occur when the image data has discre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monatshefte für Mathematik

سال: 2017

ISSN: 0026-9255,1436-5081

DOI: 10.1007/s00605-017-1128-9